Scheduling DAG Structured Computations
نویسندگان
چکیده
منابع مشابه
Performance implications of synchronization structure in parallel programming
The restricted synchronization structure of so-called structured parallel programming paradigms has an advantageous effect on programmer productivity, cost modeling, and scheduling complexity. However, imposing these restrictions can lead to a loss of parallelism, compared to using a programming approach that does not impose synchronization structure. In this paper we study the potential loss o...
متن کاملScheduling DAGs Opportunistically: The Dream and the Reality Circa 2016
A broad-brush tour of a platform-oblivious approach to scheduling dag-structured computations on platforms whose resources can change dynamically, both in availability and efficiency. The main focus is on the IC-scheduling and Area-oriented scheduling paradigms— the motivation, the dream, the implementation, and initial work on evaluation.
متن کاملHierarchical Scheduling of DAG Structured Computations on Manycore Processors with Dynamic Thread Grouping
Many computational solutions can be expressed as directed acyclic graphs (DAGs) with weighted nodes. In parallel computing, scheduling such DAGs onto manycore processors remains a fundamental challenge, since synchronization across dozens of threads and preserving precedence constraints can dramatically degrade the performance. In order to improve scheduling performance on manycore processors, ...
متن کاملPartitioning Dag Computations: a Cautionary Note
The representation of a parallel computation as a directed acyclic graph can help the programmer to analyse the properties of the computation in order to optimise partitioning and scheduling. We point out that the results obtained from such \optimizations" are only as good as the underlying cost model.
متن کاملEfficient Primitives for Creating and Scheduling Parallel Computations
We give a brief overview of our ongoing work on developing efficient and expressive abstractions for programming multicore machines. We propose a programming interface for expressing a parallel computation dynamically, as a directed acyclic graph (DAG). The DAG consists of tasks and dependencies between them. Because our interface lets the DAG take shape as the computation unfolds, the programm...
متن کامل